The college principal revisited
نویسندگان
چکیده
منابع مشابه
Theory of Principal Partitions Revisited
The theory of principal partitions of discrete systems such as graphs, matrices, matroids, and submodular systems has been developed since 1968. In the early stage of the developments during 1968–75 the principal partition was considered as a decomposition of a discrete system into its components together with a partially ordered structure of the set of the components. It then turned out that s...
متن کاملAltruism in the Principal-Agent Model: The Samaritan’s Dilemma Revisited∗
We analyze the Samaritan’s Dilemma problem in a principal-agent setting in which transfers from an altruist to the agent have an effect on the agent’s contractual relationship with the principal. We show that the presence of the altruist can affect the terms of the principal-agent contract in a way so that the standard inefficiency result of effort underprovision in the Samaritan’s Dilemma cont...
متن کاملScheduling a Major College Basketball Conference - Revisited
Nemhauser and Trick presented the problem of nding a timetable for the 1997/98 Atlantic Coast Conference (ACC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC. Finite-domain constraint programmingis another programming technique that can be used for solving combinatorial search problems such as sports tournament ...
متن کاملReciprocating Preferences Stablize Matching: College Admissions Revisited
In considering the college admissions problem, almost fifty years ago, Gale and Shapley came up with a simple abstraction based on preferences of students and colleges. They introduced the concept of stability and optimality; and proposed the deferred acceptance (DA) algorithm that is proven to lead to a stable and optimal solution. This algorithm is simple and computationally efficient. Furthe...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Vocational Aspect of Education
سال: 1976
ISSN: 0305-7879
DOI: 10.1080/10408347308000561